TSTP Solution File: ITP128^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP128^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n031.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:07:03 EDT 2024

% Result   : Theorem 0.45s 0.71s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   11 (   7 unt;   4 typ;   0 def)
%            Number of atoms       :    7 (   0 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    9 (   3   ~;   0   |;   0   &;   6   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :    0 (   0   ^   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    c: $tType ).

thf(decl_sort2,type,
    a: $tType ).

thf(decl_203,type,
    finite746615251te_a_c: ( a > c > c ) > $o ).

thf(decl_379,type,
    f1: a > c > c ).

thf(conj_0,conjecture,
    finite746615251te_a_c @ f1,
    file('/export/starexec/sandbox2/tmp/tmp.brCaJTZWgo/E---3.1_18499.p',conj_0) ).

thf(fact_0_assms_I2_J,axiom,
    finite746615251te_a_c @ f1,
    file('/export/starexec/sandbox2/tmp/tmp.brCaJTZWgo/E---3.1_18499.p',fact_0_assms_I2_J) ).

thf(c_0_2,negated_conjecture,
    ~ ( finite746615251te_a_c @ f1 ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_3,negated_conjecture,
    ~ ( finite746615251te_a_c @ f1 ),
    inference(fof_nnf,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ~ ( finite746615251te_a_c @ f1 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,plain,
    finite746615251te_a_c @ f1,
    inference(split_conjunct,[status(thm)],[fact_0_assms_I2_J]) ).

thf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.23  % Problem    : ITP128^1 : TPTP v8.1.2. Released v7.5.0.
% 0.10/0.24  % Command    : run_E %s %d THM
% 0.23/0.44  % Computer : n031.cluster.edu
% 0.23/0.44  % Model    : x86_64 x86_64
% 0.23/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.44  % Memory   : 8042.1875MB
% 0.23/0.44  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.23/0.44  % CPULimit   : 300
% 0.23/0.44  % WCLimit    : 300
% 0.23/0.44  % DateTime   : Fri May  3 12:46:02 EDT 2024
% 0.23/0.44  % CPUTime    : 
% 0.45/0.66  Running higher-order theorem proving
% 0.45/0.66  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.brCaJTZWgo/E---3.1_18499.p
% 0.45/0.71  # Version: 3.1.0-ho
% 0.45/0.71  # Preprocessing class: HSLMSMSSSSLNHSA.
% 0.45/0.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.71  # Starting new_ho_10 with 1500s (5) cores
% 0.45/0.71  # Starting lpo6_lambda_fix with 300s (1) cores
% 0.45/0.71  # Starting additional_ho_4 with 300s (1) cores
% 0.45/0.71  # Starting full_lambda_7 with 300s (1) cores
% 0.45/0.71  # full_lambda_7 with pid 18580 completed with status 0
% 0.45/0.71  # Result found by full_lambda_7
% 0.45/0.71  # Preprocessing class: HSLMSMSSSSLNHSA.
% 0.45/0.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.71  # Starting new_ho_10 with 1500s (5) cores
% 0.45/0.71  # Starting lpo6_lambda_fix with 300s (1) cores
% 0.45/0.71  # Starting additional_ho_4 with 300s (1) cores
% 0.45/0.71  # Starting full_lambda_7 with 300s (1) cores
% 0.45/0.71  # SinE strategy is GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true)
% 0.45/0.71  # Search class: HGUSM-FFMM32-DHSFFSNN
% 0.45/0.71  # partial match(3): HGUSM-FSLM32-DHSFFSBN
% 0.45/0.71  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.71  # Starting new_ho_10 with 163s (1) cores
% 0.45/0.71  # new_ho_10 with pid 18581 completed with status 0
% 0.45/0.71  # Result found by new_ho_10
% 0.45/0.71  # Preprocessing class: HSLMSMSSSSLNHSA.
% 0.45/0.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.71  # Starting new_ho_10 with 1500s (5) cores
% 0.45/0.71  # Starting lpo6_lambda_fix with 300s (1) cores
% 0.45/0.71  # Starting additional_ho_4 with 300s (1) cores
% 0.45/0.71  # Starting full_lambda_7 with 300s (1) cores
% 0.45/0.71  # SinE strategy is GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true)
% 0.45/0.71  # Search class: HGUSM-FFMM32-DHSFFSNN
% 0.45/0.71  # partial match(3): HGUSM-FSLM32-DHSFFSBN
% 0.45/0.71  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.71  # Starting new_ho_10 with 163s (1) cores
% 0.45/0.71  # Preprocessing time       : 0.004 s
% 0.45/0.71  # Presaturation interreduction done
% 0.45/0.71  
% 0.45/0.71  # Proof found!
% 0.45/0.71  # SZS status Theorem
% 0.45/0.71  # SZS output start CNFRefutation
% See solution above
% 0.45/0.71  # Parsed axioms                        : 735
% 0.45/0.71  # Removed by relevancy pruning/SinE    : 690
% 0.45/0.71  # Initial clauses                      : 48
% 0.45/0.71  # Removed in clause preprocessing      : 0
% 0.45/0.71  # Initial clauses in saturation        : 48
% 0.45/0.71  # Processed clauses                    : 2
% 0.45/0.71  # ...of these trivial                  : 0
% 0.45/0.71  # ...subsumed                          : 0
% 0.45/0.71  # ...remaining for further processing  : 1
% 0.45/0.71  # Other redundant clauses eliminated   : 0
% 0.45/0.71  # Clauses deleted for lack of memory   : 0
% 0.45/0.71  # Backward-subsumed                    : 0
% 0.45/0.71  # Backward-rewritten                   : 0
% 0.45/0.71  # Generated clauses                    : 0
% 0.45/0.71  # ...of the previous two non-redundant : 0
% 0.45/0.71  # ...aggressively subsumed             : 0
% 0.45/0.71  # Contextual simplify-reflections      : 0
% 0.45/0.71  # Paramodulations                      : 0
% 0.45/0.71  # Factorizations                       : 0
% 0.45/0.71  # NegExts                              : 0
% 0.45/0.71  # Equation resolutions                 : 0
% 0.45/0.71  # Disequality decompositions           : 0
% 0.45/0.71  # Total rewrite steps                  : 1
% 0.45/0.71  # ...of those cached                   : 0
% 0.45/0.71  # Propositional unsat checks           : 0
% 0.45/0.71  #    Propositional check models        : 0
% 0.45/0.71  #    Propositional check unsatisfiable : 0
% 0.45/0.71  #    Propositional clauses             : 0
% 0.45/0.71  #    Propositional clauses after purity: 0
% 0.45/0.71  #    Propositional unsat core size     : 0
% 0.45/0.71  #    Propositional preprocessing time  : 0.000
% 0.45/0.71  #    Propositional encoding time       : 0.000
% 0.45/0.71  #    Propositional solver time         : 0.000
% 0.45/0.71  #    Success case prop preproc time    : 0.000
% 0.45/0.71  #    Success case prop encoding time   : 0.000
% 0.45/0.71  #    Success case prop solver time     : 0.000
% 0.45/0.71  # Current number of processed clauses  : 1
% 0.45/0.71  #    Positive orientable unit clauses  : 1
% 0.45/0.71  #    Positive unorientable unit clauses: 0
% 0.45/0.71  #    Negative unit clauses             : 0
% 0.45/0.71  #    Non-unit-clauses                  : 0
% 0.45/0.71  # Current number of unprocessed clauses: 46
% 0.45/0.71  # ...number of literals in the above   : 87
% 0.45/0.71  # Current number of archived formulas  : 0
% 0.45/0.71  # Current number of archived clauses   : 0
% 0.45/0.71  # Clause-clause subsumption calls (NU) : 0
% 0.45/0.71  # Rec. Clause-clause subsumption calls : 0
% 0.45/0.71  # Non-unit clause-clause subsumptions  : 0
% 0.45/0.71  # Unit Clause-clause subsumption calls : 0
% 0.45/0.71  # Rewrite failures with RHS unbound    : 0
% 0.45/0.71  # BW rewrite match attempts            : 0
% 0.45/0.71  # BW rewrite match successes           : 0
% 0.45/0.71  # Condensation attempts                : 2
% 0.45/0.71  # Condensation successes               : 0
% 0.45/0.71  # Termbank termtop insertions          : 11047
% 0.45/0.71  # Search garbage collected termcells   : 6295
% 0.45/0.71  
% 0.45/0.71  # -------------------------------------------------
% 0.45/0.71  # User time                : 0.009 s
% 0.45/0.71  # System time              : 0.004 s
% 0.45/0.71  # Total time               : 0.013 s
% 0.45/0.71  # Maximum resident set size: 4432 pages
% 0.45/0.71  
% 0.45/0.71  # -------------------------------------------------
% 0.45/0.71  # User time                : 0.033 s
% 0.45/0.71  # System time              : 0.007 s
% 0.45/0.71  # Total time               : 0.040 s
% 0.45/0.71  # Maximum resident set size: 3480 pages
% 0.45/0.71  % E---3.1 exiting
% 0.45/0.71  % E exiting
%------------------------------------------------------------------------------